Local Out-Tournaments with Upset Tournament Strong Components I: Full and Equal {0, 1}-Matrix Ranks
نویسندگان
چکیده
A digraph D is a local out-tournament if the outset of every vertex: is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corresponding results for biclique covers and partitions ofthe digraph are provided.
منابع مشابه
Connectivity of local tournaments
For a local tournament D with minimum out-degree δ, minimum indegree δ− and irregularity ig(D), we give a lower bound on the connectivity of D, namely κ(D) ≥ (2 ·max{δ+, δ−}+ 1− ig(D))/3 if there exists a minimum separating set S such that D − S i is a tournament, and κ(D) ≥ (2 ·max{δ+, δ−}+ 2|δ+ − δ−|+ 1− 2ig(D))/3 otherwise. This generalizes a result on tournaments presented by C. Thomassen [...
متن کاملRestricted arc-connectivity of generalized tournaments
If D is a strongly connected digraph, then an arc set S of D is called a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. Recently, Volkmann [12] defined the restricted arc-connectivity λ(D) as the minimum cardinality over all restricted arc-cuts S. A strongly connected digraph D is called λconnected when λ(D) exists. Let k ≥ 2 be an i...
متن کاملAsymptotic Enumeration of Tournaments with a Given Score Sequence
A tournament is a digraph in which, for each pair of distinct vertices v and w, either (v,w) or (w, v) is an edge, but not both. A tournament is regular if the in-degree is equal to the out-degree at each vertex. Let v1, v2, . . . , vn be the vertices of a labelled tournament and let d−j , d + j be the in-degree and out-degree of vj for 1 ≤ j ≤ n. d+j is also called the score of vj . Define δj ...
متن کاملA Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n−1 3 . A known construction shows this number is best possible when n ≡ 1 mod 3 and gives similar minimal values for n congruent to 0 and 2 modulo 3. A tournament T = (V, A) is an oriented complete graph. Let hp(T ) be the number of distinct hamiltonian paths in T (i.e., directed paths that in...
متن کاملExtending partial tournaments
Let A be a (0, 1, ∗)-matrix with main diagonal all 0’s and such that if ai,j = 1 or ∗ then aj,i = ∗ or 0. Underwhat conditions on the row sums, and or column sums, of A is it possible to change the ∗’s to 0’s or 1’s and obtain a tournament matrix (the adjacency matrix of a tournament) with a specified score sequence? We answer this question in the case of regular and nearly regular tournaments....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 95 شماره
صفحات -
تاریخ انتشار 2010